Fractal spline as a model of fractal functions for fractal signals generation
نویسندگان
چکیده
منابع مشابه
Generalized Cubic Spline Fractal Interpolation Functions
We construct a generalized Cr-Fractal Interpolation Function (Cr-FIF) f by prescribing any combination of r values of the derivatives f (k), k = 1, 2, . . . , r, at boundary points of the interval I = [x0, xN ]. Our approach to construction settles several questions of Barnsley and Harrington [J. Approx Theory, 57 (1989), pp. 14–34] when construction is not restricted to prescribing the values ...
متن کاملSpline Coalescence Hidden Variable Fractal Interpolation Functions
This paper generalizes the classical spline using a new construction of spline coalescence hidden variable fractal interpolation function (CHFIF). The derivative of a spline CHFIF is a typical fractal function that is self-affine or non-self-affine depending on the parameters of a nondiagonal iterated function system. Our construction generalizes the construction of Barnsley and Harrington (198...
متن کاملFractal Modeling of Speech Signals
In this paper, we present a method for speech signal analysis and synthesis based on IFS theory. We consider a speech signal as the graph of a continuous function whose irregularity, measured in terms of its local HH older exponents, is arbitrary. We extract a few remarkable points in the signal and perform a fractal interpolation between them using a classical technique based on IFS theory. We...
متن کاملSuper Fractal Interpolation Functions
Abstract: In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of nature or outcomes of scientific experiments that reveal one or more structures embedded in to another. In the construction of SFIF, an IFS is chosen from a pool of several IFSs at each level of iteration leading to implementation of the desired randomnes...
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Research and Modeling
سال: 2013
ISSN: 2076-7633,2077-6853
DOI: 10.20537/2076-7633-2013-5-4-583-587